Asymptotic Enumeration of Eulerian Circuits in the Complete Graph
نویسندگان
چکیده
We determine the asymptotic behaviour of the number of eulerian circuits in a complete graph of odd order. One corollary of our result is the following. If a maximum random walk, constrained to use each edge at most once, is taken on Kn, then the probability that all the edges are eventually used is asymptotic to en. Some similar results are obtained about eulerian circuits and spanning trees in random regular tournaments. We also give exact values for up to 21 nodes.
منابع مشابه
Asymptotic enumeration of Eulerian circuits for graphs with strong mixing properties
Let G be a simple connected graph all of whose vertices have even degrees. An Eulerian circuit in G is a closed walk (see, for example, [2]) which uses every edge of G exactly once. Two Eulerian circuits are called equivalent if one is a cyclic permutation of the other. It is clear that the size of such an equivalence class equals the number of edges of graph G. Let EC(G) denote the number of e...
متن کاملLine graphs associated to the maximal graph
Let $R$ be a commutative ring with identity. Let $G(R)$ denote the maximal graph associated to $R$, i.e., $G(R)$ is a graph with vertices as the elements of $R$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $R$ containing both. Let $Gamma(R)$ denote the restriction of $G(R)$ to non-unit elements of $R$. In this paper we study the various graphi...
متن کاملInformation in Strings: Enumeration of Eulerian Paths and Eulerian Components in Markov Sequences
In this paper, we evaluate the number of Eulerian circuits that can be obtained by an arbitrary rotation in a Markovian string, i.e., corresponding to a given Markovian type. Since all rotations do not result in an Eulerian circuit, but several of them, called Eulerian components; we also investigate the number of Eulerian components that result from a random rotation in a Markovian string. We ...
متن کاملCounting Eulerian Circuits is #P-Complete
We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P. The method employed is mod-p reduction from counting Eulerian orientations.
متن کاملAsymptotic Behaviour of the Number of Eulerian Circuits
Let G be a simple connected graph all of whose vertices have even degree. A Eulerian circuit in G is a closed walk (see, for example, [2]) which uses every edge of G exactly once. We let Eul(G) denote the number of these up to cyclic equivalence. Our purpose in this paper is to estimate Eul(G) for those G having large algebraic connectivity. Our method is to adopt the proof given in [6] for the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 7 شماره
صفحات -
تاریخ انتشار 1998